package Test;

import java.util.HashMap;
import java.util.Scanner;

public class TTT7 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int length = Integer.parseInt(sc.nextLine());
        long[] arr = new long[length];
        for (int i = 0; i < length; i++) {
            arr[i] = sc.nextLong();
        }
        int sum1 = 0;
        int sum2 = 0;
        int max1 = 0;
        int max2 = 0;
        HashMap<Long, Integer> map1 = new HashMap<>();
        HashMap<Long, Integer> map2 = new HashMap<>();
        for (int i = 0; i < length; i += 2) {
            sum1++;
            map1.compute(arr[i], (k, v) -> v == null ? 1 : v + 1);
        }
        for (int i = 1; i < length; i += 2) {
            sum2++;
            map2.compute(arr[i], (k, v) -> v == null ? 1 : v + 1);
        }
        //找众数
        for (int i = 0; i < length; i += 2) {
            if (map1.get(arr[i]) > max1) max1 = map1.get(arr[i]);
        }
        for (int i = 1; i < length; i += 2) {
            if (map2.get(arr[i]) > max2) max2 = map2.get(arr[i]);
        }
        System.out.println(sum1 + sum2 - max1 - max2);
    }
}
